Supporting Schema References in Keyword Queries over Relational Databases

Relational Keyword Search (R-KwS) systems enable naive/informal users to explore and retrieve information from relational databases without knowing schema details or query languages. They take a keyword query, locate their corresponding elements in the target database, connect them using on PK/FK constraints. Although there are many such literature, most of only support queries with keywords referring contents database just very few refering schema. We propose Lathe, novel R-KwS that supports queries. To this end, we first generalize well-known concepts Candidate Joining Networks (CJNs) Query Matches (QMs) handle new algorithms generate them. Then, introduce two major innovations: ranking algorithm for selecting better QMs, yielding generation fewer but CJNs, an eager evaluation strategy pruning void useless CJNs. present experiments performed sets datasets previously experimented state-of-the-art systems. Our results indicate Lathe can wider variety while remaining highly effective, even intricate schemas.